Compressing Recursion
نویسندگان
چکیده
منابع مشابه
Inference of Node Replacement Recursive Graph Grammars
In this paper we describe an approach to learning node replacement graph grammars. This approach is based on previous research in frequent isomorphic subgraphs discovery. We extend the search for frequent subgraphs by checking for overlap among the instances of the subgraphs in the input graph. If subgraphs overlap by one node we propose a node replacement grammar production. We also can infer ...
متن کاملArtificial general intelligence through recursive data compression and grounded reasoning: a position paper
This paper presents a tentative outline for the construction of an artificial, generally intelligent system (AGI). It is argued that building a general data compression algorithm solving all problems up to a complexity threshold should be the main thrust of research. A measure for partial progress in AGI is suggested. Although the details are far from being clear, some general properties for a ...
متن کاملCalculation for Energy of (111) Surfaces of Palladium in Tight Binding Model
In this work calculation of energetics of transition metal surfaces is presented. The tight-binding model is employed in order to calculate the energetics. The tight-binding basis set is limited to d orbitals which are valid for elements at the end of transition metals series. In our analysis we concentrated on electronic effects at temperature T=0 K, this means that no entropic term will be pr...
متن کاملFractal Images Compressing by Estimating the Closest Neighborhood with Using of Schema Theory
Problem statement: One of the methods used for compressing images and especially natural images is by benefiting from fractal features of images. Natural images have properties like Self-Similarity that can be used in image compressing. The basic approach in compressing methods is based on the fractal features and searching the best replacement block for the original image. Approach: In this re...
متن کاملCompressing Thin Spheres in the Complement of a Link
Let L be a link in S that is in thin position but not in bridge position and let P be a thin level sphere. We generalize a result of Wu by giving a bound on the number of disjoint irreducible compressing disks P can have, including identifying thin spheres with unique compressing disks. We also give conditions under which P must be incompressible on a particular side or be weakly incompressible...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005